Two applications of pseudo-random graphs
نویسنده
چکیده
We discuss two constructions based on pseudo-random graphs: a bitprobe scheme with one-sided error that provides a very compact encoding for small sets from a large universe, and an asymptotically optimal randomized communication protocol that synchronizes remote strings of bits with a small Hamming distance. We show that in both cases rather standard derandomization technique (e.g., Nisan’s generator of pseudorandom bits) is enough to get surprisingly strong statements.
منابع مشابه
Random and Pseudo-Random Walks on Graphs
Random walks on graphs have turned out to be a powerful tool in the design of algorithms and other applications. In particular, expander graphs, which are graphs on which random walks have particularly good properties, are extremely useful in complexity and other areas of computer science. In this chapter we study random walks on general regular graphs, leading to a the randomized logspace algo...
متن کاملRandom and Pseudo-Random Walks on Graphs
Random walks on graphs have turned out to be a powerful tool in the design of algorithms and other applications. In particular, expander graphs, which are graphs on which random walks have particularly good properties, are extremely useful in complexity and other areas of computer science. In this chapter we will study random walks on general graphs, leading to a the randomized logspace algorit...
متن کاملPseudo-Random Graphs for Fast Consensus Protocol
In this paper, we focus on the design of network topology to achieve fast information distribution. We present the information distribution performance of Borel Cayley graphs, a family of pseudo-random graphs, is far superior than that of other well-known graph families. To demonstrate the effectiveness of this pseudo-random approach, we compare the convergence speed of the average consensus pr...
متن کاملTwo Constructions for Tower-Type Lower Bounds of Szemerédi’s Regularity Lemma
The theory of random graph is one of the most important theories in modern combinatorics and theoretical computer science. This naturally leads to the following question: what is the essential property of a random graph? How can we distinguish a given graph from a random graphs? This leads to the development of pseudo-random graph theory (quasi-random graphs). [2] gives a complete survey on pse...
متن کاملPseudo-random Graphs
Random graphs have proven to be one of the most important and fruitful concepts in modern Combinatorics and Theoretical Computer Science. Besides being a fascinating study subject for their own sake, they serve as essential instruments in proving an enormous number of combinatorial statements, making their role quite hard to overestimate. Their tremendous success serves as a natural motivation ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011